#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MOD = 1e9 + 7;
const int N = 2010;

int gcd(int a, int b)
{
    return b ? gcd(b, a % b) : a;
}

ll qui(ll a, ll b)
{
    ll res = 1;
    while(b)
    {
        if(b & 1)res = res * a % MOD;
        b >>= 1;
        a = a * a % MOD;
    }
    return res;
}

ll fac[N], inv_fac[N];
ll S[N][N];

void init()
{
    fac[0] = 1;
    for(int i = 1; i < N; i++)
        fac[i] = fac[i - 1] * i % MOD;
    inv_fac[N - 1] = qui(fac[N - 1], MOD - 2);
    for(int i = N - 1; i > 0; i--)
        inv_fac[i - 1] = inv_fac[i] * i % MOD;
    S[0][0] = 1;
    for (int i = 1; i < N; ++i) {
        for (int j = 1; j < N; ++j) {
            S[i][j] = (j * S[i - 1][j] % MOD + S[i - 1][j - 1]) % MOD;
        }
    }
}

ll comb(int a, int b)
{
    return fac[a] * inv_fac[b] % MOD * inv_fac[a - b] % MOD;
}

int f[10] = {1, 0, 0, 0, 1, 0, 1, 0, 2, 1};

ll g(int n) {
    int res = 0;
    string s = to_string(n);
    for(auto ch : s){
        res += f[ch - '0'];
    }
    return res;
}


void solve(){
    ll m, k;
    cin >> m >> k;
    if(k == 0) {
        cout << m << endl;
        return;
    }
    ll t = g(m);
    for(int i = 1; i < k; i++){
        t = g(t);
        if(t == 0){
            if((k - i - 1) & 1) {
                cout << 1 << endl;
            }else{
                cout << 0 << endl;
            }
            return;
        }
    }
    cout << t << endl;

}

int main()
{
    int t;
    cin >> t;
    while(t--) solve();
    return 0;
}